A Lindstrom theorem for modal logic
نویسنده
چکیده
A modal analogue of Lindstrr om's characterization of rst-order logic is proved. Basic modal logics are characterized as the only modal logics that have a notion of nite rank, or, equivalently, as the strongest modal logic whose formulas are preserved under ultra-products over !. Also, basic modal logic is the strongest classical logic whose formulas are preserved under bisimulations and ultra-products over !.
منابع مشابه
Suhrawardi's Modal Syllogisms
Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...
متن کاملA Duality for Distributive Unimodal Logic
We introduce distributive unimodal logic as a modal logic of binary relations over posets which naturally generalizes the classical modal logic of binary relations over sets. The relational semantics of this logic is similar to the relational semantics of intuitionistic modal logic and positive modal logic, but it generalizes both of these by placing no restrictions on the accessibility relatio...
متن کاملTemporalizing Modal Epistemic Logic
Timed Modal Epistemic Logic, tMEL, is a newly introduced logical framework for reasoning about the modeled agent's knowledge. The framework, derived from the study of Justi cation Logic, is adapted from the traditional Modal Epistemic Logic, MEL, to serve as a logically non-omniscient epistemic logic and dealing with problems where the the temporal constraint is an unavoidable factor. In this p...
متن کاملModal logic as metalogic
The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's. First a family of propositional logical systems is considered, which is obtained by gradually addin...
متن کاملMSPASS: Modal Reasoning by Translation and First-Order Resolution
mspass is an extension of the first-order theorem prover spass, which can be used as a modal logic theorem prover, a theorem prover for description logics and a theorem prover for the relational cal-
متن کامل